Two-agent single-machine scheduling problems under increasing linear deterioration
نویسندگان
چکیده
منابع مشابه
Single machine scheduling problems with delivery times under simple linear deterioration
We consider several single machine scheduling problems in which the processing time of a job is a simple linear increasing function of its starting time and each job has a delivery time. The objectives are to minimize the functions about delivery completion times. For the former three problems, we propose polynomial-time algorithms to solve them. For the last problem, we prove that it is NP-har...
متن کاملSingle-Machine two-agent scheduling problems with unconstrained strategies
We address a class of deterministic scheduling problems in which two agents compete for the usage of a single machine. The agents have their own objective functions and submit in each round an arbitrary, unprocessed task from their buffer for possible selection. In each round the shorter of the two submitted tasks is chosen and processed on the machine. We consider the problems under two distin...
متن کاملSingle-machine group scheduling problems with deterioration consideration
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we consider deterioration in the framework ofminimizing themakespan and the total completion time in single-machine group sched...
متن کاملSingle-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration
Maintenance is important to manufacturing process as it helps improve the efficiency of production. Although different models of joint deterioration and learning effects have been studied extensively in various areas, it has rarely been studied in the context of scheduling with maintenance activities. This paper considers scheduling with jointly the deterioration and learning effects and multi-...
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2011
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.11.026